A logic of interactive proofs
نویسندگان
چکیده
Abstract We introduce the probabilistic two-agent justification logic $\textsf {IPJ}$, a in which we can reason about agents that perform interactive proofs. In order to study growth rate of probabilities present new method parametrizing {IPJ}$ over certain negligible functions. Further, our approach leads notion zero-knowledge
منابع مشابه
A Logic-style Version of Interactive Proofs
Interactive proofs are de ned in terms of a conversation between two Turing machines, the prover and the veri er. We de ne an equivalent kind of proof in terms more usual for logic: our proofs are derivations from axioms by rules of inference. Namely, we consider proofs in formal arithmetic extended by some additional rule that uses random numbers. Such a proof can be considerably shorter than ...
متن کاملLogic of Non-monotonic Interactive Proofs
We propose a monotonic logic of internalised non-monotonic or instant interactive proofs (LiiP) and reconstruct an existing monotonic logic of internalised monotonic or persistent interactive proofs (LiP) as a minimal conservative extension of LiiP. Instant interactive proofs effect a fragile epistemic impact in their intended communities of peer reviewers that consists in the impermanent induc...
متن کاملA Logic of Interactive Proofs (Formal Theory of Knowledge Transfer)
We propose a logic of interactive proofs as a framework for an intuitionistic foundation for interactive computation, which we construct via an interactive analog of the Gödel-McKinsey-Tarski-Artëmov definition of Intuitionistic Logic as embedded into a classical modal logic of proofs, and of the Curry-Howard isomorphism between intuitionistic proofs and typed programs. Our interactive proofs e...
متن کاملOpen Proofs and Open Terms: A Basis for Interactive Logic
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these incomplete proofs by presenting open higher order logic o-Predω as a conservative extension of Predω. We define a typing system o-λPredω and show that the CurryHoward embedding extends to embedding into o-λPredω. We s...
متن کاملInteractive Coding for Interactive Proofs
We consider interactive proof systems over adversarial communication channels. We show that the seminal result that IP = PSPACE still holds when the communication channel is malicious, allowing even a constant fraction of the communication to be arbitrarily corrupted. Supported in part by NSF CNS 1413971 and NSF CCF 1423306. Partially supported by gifts from VMware Labs and Google, and NSF gran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2022
ISSN: ['1465-363X', '0955-792X']
DOI: https://doi.org/10.1093/logcom/exac071